High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
نویسندگان
چکیده
The reconstruction of high-dimensional sparse signals is a challenging task in wide range applications. In order to deal with problems, efficient fast Fourier transform algorithms are essential tools. second and third authors have recently proposed dimension-incremental approach, which only scales almost linear the number required sampling values quadratic arithmetic complexity respect spatial dimension d. Using reconstructing rank-1 lattices as scheme, method showed reliable results numerical tests but suffers from relatively large numbers samples operations. Combining preferable properties small sample complexities, first author developed concept multiple lattices. this paper, both concepts — coupled, yields distinctly improved transform. Moreover, resulting algorithm analyzed detail success probability, samples, complexity. comparison single lattices, utilization reduction complexities by an factor sparsity. Various confirm theoretical results, high performance, reliability method.
منابع مشابه
High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
The reconstruction of high-dimensional sparse signals is a challenging task in a wide range of applications. In order to deal with high-dimensional problems, efficient sparse fast Fourier transform algorithms are essential tools. The second and third authors have recently proposed a dimension-incremental approach, which only scales almost linear in the number of required sampling values and alm...
متن کاملSparse high-dimensional FFT based on rank-1 lattice sampling
In this paper, we suggest approximate algorithms for the reconstruction of sparse high-dimensional trigonometric polynomials, where the support in frequency domain is unknown. Based on ideas of constructing rank-1 lattices component-by-component, we adaptively construct the index set of frequencies belonging to the non-zero Fourier coefficients in a dimension incremental way. When we restrict t...
متن کاملReconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...
متن کاملTextures on Rank-1 Lattices
Storing textures on orthogonal tensor product lattices is predominant in computer graphics, although it is known that their sampling efficiency is not optimal. In two dimensions, the hexagonal lattice provides the maximum sampling efficiency. However, handling these lattices is difficult, because they are not able to tile an arbitrary rectangular region and have an irrational basis. By storing ...
متن کاملSimulation on Rank-1 Lattices
Rank-1 lattices are available in any dimension for any number of lattice points and because their generation is so efficient, they often are used in quasi-Monte Carlo methods. Applying the Fourier transform to functions sampled on rank-1 lattice points turns out to be simple and efficient if the number of lattice points is a power of two. Considering the Voronoi diagram of a rank-1 lattice as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2021
ISSN: ['1096-603X', '1063-5203']
DOI: https://doi.org/10.1016/j.acha.2020.11.002